An upper limit on the number of nodes in a regular graph of degree d>2 and diameter k: N(d,k) <= 2="" d(d-1)^k="" -="" ------------="" d-2=""